Are Pregnant Women Happier? Racial Differences in the Relationsip Between Pregnancy and Life Satisfaction

This paper uses data from the Behavioral Risk Factor Surveillance System (BRFSS) to study the relationship between pregnancy and life satisfaction for women of childbearing age. The results show strong differences by race. Pregnancy has the strongest positive correlation with happiness for Whites, a smaller but still statistically significant positive correlation for Hispanics, and no relationship for Blacks. The results cannot be explained by differences in other demographics such age, income, education, or marital status. Within each racial group, the results hold across different categories for all these characteristics. There is evidence that racial differences in the effects of pregnancy on emotional and social support from others can partly explain this result.pregnancy, life satisfaction, racial differences

MIRAI Architecture for Heterogeneous Network

One of the keywords that describe next-generation wireless communications is "seamless." As part of the e-Japan Plan promoted by the Japanese Government, the Multimedia Integrated Network by Radio Access Innovation project has as its goal the development of new technologies to enable seamless integration of various wireless access systems for practical use by 2005. This article describes a heterogeneous network architecture including a common tool, a common platform, and a common access. In particular, software-defined radio technologies are used to develop a multiservice user terminal to access different wireless networks. The common platform for various wireless networks is based on a wireless-supporting IPv6 network. A basic access network, separated from other wireless access networks, is used as a means for wireless system discovery, signaling, and paging. A proof-of-concept experimental demonstration system is available

Quark production, Bose-Einstein condensates and thermalization of the quark-gluon plasma

In this paper, we study the thermalization of gluons and N_f flavors of massless quarks and antiquarks in a spatially homogeneous system. First, two coupled transport equations for gluons and quarks (and antiquarks) are derived within the diffusion approximation of the Boltzmann equation, with only 2 2 processes included in the collision term. Then, these transport equations are solved numerically in order to study the thermalization of the quark-gluon plasma. At initial time, we assume that no quarks or antiquarks are present and we choose the gluon distribution in the form f = f_0 theta (1-p/Q_s) with Q_s the saturation momentum and f_0 a constant. The subsequent evolution of systems may, or may not, lead to the formation of a (transient) Bose condensate, depending on the value of f_0. In fact, we observe, depending on the value of f_0, three different patterns: (a) thermalization without gluon Bose-Einstein condensate (BEC) for f_0 < f_{0t}, (b) thermalization with transient BEC for f_{0t} < f_0 < f_{0c}, and (c) thermalization with BEC for f_{0c} < f_0. The values of f_{0t} and f_{0c} depend on N_f. When f_0> 1 > f_{0c}, the onset of BEC occurs at a finite time t_c ~ 1/((alpha_s f_0)^2 Q_s). We also find that quark production slows down the thermalization process: the equilibration time for N_f = 3 is typically about 5 to 6 times longer than that for N_f = 0 at the same Q_s.Comment: 32 pages, 25 figures, minor modifications, Final version published in NP

Computationally Efficient Simulation of Queues: The R Package queuecomputer

Large networks of queueing systems model important real-world systems such as MapReduce clusters, web-servers, hospitals, call centers and airport passenger terminals. To model such systems accurately, we must infer queueing parameters from data. Unfortunately, for many queueing networks there is no clear way to proceed with parameter inference from data. Approximate Bayesian computation could offer a straightforward way to infer parameters for such networks if we could simulate data quickly enough. We present a computationally efficient method for simulating from a very general set of queueing networks with the R package queuecomputer. Remarkable speedups of more than 2 orders of magnitude are observed relative to the popular DES packages simmer and simpy. We replicate output from these packages to validate the package. The package is modular and integrates well with the popular R package dplyr. Complex queueing networks with tandem, parallel and fork/join topologies can easily be built with these two packages together. We show how to use this package with two examples: a call center and an airport terminal.Comment: Updated for queuecomputer_0.8.